Large-scale collective entity matching

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-Scale Collective Entity Matching

The difficult problem of Entity Matching (EM), i.e., determining whether different mentions of an entity refer to the same realworld object, has recently attracted a lot of attention from the Machine Learning (ML) research community. State-of-the-art solutions for EM are based on recent advances in ML, such as firstorder probabilistic models (e.g., Markov and Bayesian networks) and advanced pro...

متن کامل

Efficient Large-Scale Stereo Matching

In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a triangulation on a set of support points which can be robustly matched, reducing the matching ambiguities of the remaining points. This allows for efficient exploitation of the disparity search space, yielding accurate dense recon...

متن کامل

Large-scale news entity sentiment analysis

We work on detecting positive or negative sentiment towards named entities in very large volumes of news articles. The aim is to monitor changes over time, as well as to work towards media bias detection by comparing differences across news sources and countries. With view to applying the same method to dozens of languages, we use linguistically light-weight methods: searching for positive and ...

متن کامل

Online Collective Entity Resolution

Entity resolution is a critical component of data integration where the goal is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases that have unresolved entities, we motivate the problem of quick and accurate resolution for answering queries over such ‘unclean’ databases. Since collective entity resolution approache...

متن کامل

Towards Large-Scale Schema and Ontology Matching

The purely manual specification of semantic correspondences between schemas is almost infeasible for very large schemas or when many different schemas have to be matched. Hence, solving such large-scale match tasks asks for automatic or semi-automatic schema matching approaches. Large-scale matching needs especially be supported for XML schemas and different kinds of ontologies due to their inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the VLDB Endowment

سال: 2011

ISSN: 2150-8097

DOI: 10.14778/1938545.1938546